Fixed-parameter algorithms for protein similarity search under mRNA structure constraints

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints

In the context of protein engineering, we consider the problem of computing an mRNA sequence of maximal codon-wise similarity to a given mRNA (and consequently, to a given protein) that additionally satisfies some secondary structure constraints, the so-called MRSO problem introduced in [2]. Since the MRSO problem is known to be APX-hard [7], Bongartz proposed in [7] to attack the problem using...

متن کامل

Polynomial algorithms for protein similarity search for restricted mRNA structures

In this paper we consider the problem of computing an mRNA sequence of maximal similarity for a given mRNA of secondary structure constraints, introduced by Backofen et al. in [BNS02a] denoted as the MRSO problem. The problem is known to be NP-complete for planar associated implied structure graphs of vertex degree at most 3. In [BFHV05] a first polynomial dynamic programming algorithms for MRS...

متن کامل

Protein similarity search under mRNA structural constraints: application to targeted selenocysteine insertion.

Selenocysteine is the 21th amino acid, which occurs in all kingdoms of life. Selenocysteine is encoded by the STOP-codon UGA. For its insertion, it requires a specific mRNA sequence downstream the UGA-codon that forms a hairpin like structure (called Sec insertion sequence (SECIS)). We consider the computational problem of generating new amino acid sequences containing selenocysteine. This requ...

متن کامل

Fixed-Parameter Tractable Optimization Under DNNF Constraints

Minimizing a cost function under a set of combinatorial constraints is a fundamental, yet challenging problem in AI. Fortunately, in various real-world applications, the set of constraints describing the problem structure is much less susceptible to change over time than the cost function capturing user’s preferences. In such situations, compiling the set of feasible solutions during an offline...

متن کامل

Fast Algorithms for Determining Protein Structure Similarity

The problem of identifying the common three-dimensional structure between two protein molecules has received considerable attention from both the biology community and also from algorithms researchers. A number of similarity measures have been proposed so far for this purpose. Among them are the RMS distance, those based on geometric hashing, and some based on the contact map overlap. Very rece...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Discrete Algorithms

سال: 2008

ISSN: 1570-8667

DOI: 10.1016/j.jda.2008.03.004